Branch and Bound Methods for Control Structure Design
نویسندگان
چکیده
We demonstrate the potential of branch and bound methods for handling the combinatorial problems arising in control structure design. The method efficiently solves large-scale benchmark problems for selection of controlled variables using minimum singular value rule and variable selection for stabilization. We also provide an overview of some other interesting problems that can be solved in the same framework using non-standard bounding strategies.
منابع مشابه
A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملA Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...
متن کاملTask-space Control of Electrically Driven Robots
Actuators of robot operate in the joint-space while the end-effect or of robot is controlled in the task-space. Therefore, designing a control system for a robotic system in the task-space requires the jacobian matrix information for transforming joint-space to task-space, which suffers from uncertainties. This paper deals with the robust task-space control of electrically driven robot manipula...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملAn Interface Design for General Parallel Branch-and-Bound Algorithms
Branch-and-Bound algorithms are general methods applicable to various combinatorial optimization problems. There are two hopeful methods to improve the algorithms. One is development of the algorithms which exploit the structure of each problem. The other is parallelization of the algorithms. These two methods have been studied by di erent research communities independently. If a well-designed ...
متن کامل